Orthogonal Matching Pursuit with random dictionaries
نویسنده
چکیده
In this paper we investigatet the efficiency of the Orthogonal Matching Pursuit for random dictionaries. We concentrate on dictionaries satisfying Restricted Isometry Property. We introduce a stronger Homogenous Restricted Isometry Property which is satisfied with overwhelming probability for random dictionaries used in compressed sensing. We also present and discuss some open problems about OMP.
منابع مشابه
Orthogonal Matching Pursuit : Recursive Function Approximation with Applications to WaveletDecompositionY
In this paper we describe a recursive algorithm to compute representations of functions with respect to nonorthogonal and possibly overcomplete dictionaries of elementary building blocks e.g. aane (wavelet) frames. We propose a modiication to the Matching Pursuit algorithm of Mallat and Zhang (1992) that maintains full backward orthogonality of the residual (error) at every step and thereby lea...
متن کاملSparse image representation by discrete cosine/spline based dictionaries
Mixed dictionaries generated by cosine and B-spline functions are considered. It is shown that, by highly nonlinear approaches such as Orthogonal Matching Pursuit, the discrete version of the proposed dictionaries yields a significant gain in the sparsity of an image representation.
متن کاملINTERDISCIPLINARY MATHEMATICS INSTITUTE 2010 : 01 Orthogonal super greedy algorithm and application in compressed sensing IMI
The general theory of greedy approximation is well developed. Much less is known about how specific features of a dictionary can be used for our advantage. In this paper we discuss incoherent dictionaries. We build a new greedy algorithm which is called the Orthogonal Super Greedy Algorithm (OSGA). OSGA is more efficient than a standard Orthogonal Greedy Algorithm (OGA). We show that the rates ...
متن کاملBeyond Coherence : Recovering Structured Time - Frequency Representations
We consider the problem of recovering a structured sparse representation of a signal in an overcomplete time-frequency dictionary with a particular structure. For infinite dictionaries that are the union of a nice wavelet basis and a Wilson basis, sufficient conditions are given for the Basis Pursuit and (Orthogonal) Matching Pursuit algorithms to recover a structured representation of an admis...
متن کاملDiscriminative Training of Structured Dictionaries via Block Orthogonal Matching Pursuit
It is well established that high-level representations learned via sparse coding are effective for many machine learning applications such as denoising and classification. In addition to being reconstructive, sparse representations that are discriminative and invariant can further help with such applications. In order to achieve these desired properties, this paper proposes a new framework that...
متن کامل